(R,RFc,SRu)-Chlorido(η6-p-cymene){1-[1-(diphenylphosphanyl)ethyl]-2-[2-(diphenylphosphanyl)phenyl]ferrocene-κ2P,P′}ruthenium(II) hexafluoridophosphate
نویسندگان
چکیده
منابع مشابه
P P 1 2
In the paper, we consider the problem of computing visibility information on digital terrain models. Visibility problems on polyhedral terrains are classi ed according to the kind of visibility information computed into point visibility, line visibility and region visibility. A survey of the state-of-the-art of the algorithms for computing visibility is presented, according to the classi cation...
متن کاملCollision-induced (2)P(1/2) - (2)P(3/2) mixing in sodium
The total cross sections for Inelastic collisions between excited sodium and noble gas atoms in their ground states, leading to 2 2 3 P^y2 — — 3 ^3/2 excitation transfer in sodium, have been determined in a series of sensitized fluorescence experiments with pure sodium vapour and its mixtures with noble gases. In the experiments with pure sodium, the sodium vapour pressure was varied over the r...
متن کاملp t . 5 - 1 0 , 1 9 9 9 , p p . 2 1 2 3 - 2 1 2 6 . MACHINE LEARNING OF WORD PRONUNCIATION : THE CASE AGAINSTABSTRACTIONBertjan
Word pronunciation can be learned by inductive machine learning algorithms when it is represented as a classiication task: classify a letter within its local word context as mapping to its pronunciation. On the basis of generalization accuracy results from empirical studies, we argue that word pronunciation, particularly in complex spelling systems such as that of En-glish, should not be modell...
متن کامل2 0 - 2 6 , 1 9 9 9 , p p . 2 8 5 - 2 9 2 . Memory - Based Morphological
We present a general architecture for eecient and deterministic morphological analysis based on memory-based learning, and apply it to morphological analysis of Dutch. The system makes direct mappings from letters in context to rich categories that encode morphological boundaries, syntactic class labels, and spelling changes. Both precision and recall of labeled morphemes are over 84% on held-o...
متن کاملHow to Factor N 1 and N 2 When p 1 = p 2 mod
Let N1 = p1q1 and N2 = p2q2 be two different RSA moduli. Suppose that p1 = p2 mod 2 t for some t, and q1 and q2 are α bit primes. Then May and Ritzenhofen showed that N1 and N2 can be factored in quadratic time if t ≥ 2α+ 3. In this paper, we improve this lower bound on t. Namely we prove that N1 and N2 can be factored in quadratic time if t ≥ 2α+ 1. Further our simulation result shows that our...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Crystallographica Section E Structure Reports Online
سال: 2011
ISSN: 1600-5368
DOI: 10.1107/s1600536811036506